414-bit multiplication on the ARM Cortex-M0
نویسندگان
چکیده
This thesis presents a low-level implementation of 414-bit multiplication on the ARM Cortex-M0, using four levels of Karatsuba and one level of schoolbook multiplication. This multiplication is an important part of Curve41417 created by D. Bernstein and T. Lange. This implementation requires 4014 clock cycles.
منابع مشابه
$μ$Kummer: efficient hyperelliptic signatures and key exchange on microcontrollers
We describe the design and implementation of efficient signature and key-exchange schemes for the AVR ATmega and ARM Cortex M0 microcontrollers, targeting the 128-bit security level. Our algorithms are based on an efficient Montgomery ladder scalar multiplication on the Kummer surface of Gaudry and Schost’s genus-2 hyperelliptic curve, combined with the Jacobian point recovery technique of Chun...
متن کامل\mu Kummer: Efficient Hyperelliptic Signatures and Key Exchange on Microcontrollers
We describe the design and implementation of efficient signature and key-exchange schemes for the AVR ATmega and ARM Cortex M0 microcontrollers, targeting the 128-bit security level. Our algorithms are based on an efficient Montgomery ladder scalar multiplication on the Kummer surface of Gaudry and Schost’s genus-2 hyperelliptic curve, combined with the Jacobian point recovery technique of Cost...
متن کامل8/16/32 Shades of Elliptic Curve Cryptography on Embedded Processors
The decision regarding the best suitable microprocessor for a given task is one of the most challenging assignments a hardware designer has to face. In this paper, we make a comparison of cycle-accurate VHDL clones of the 8-bit Atmel ATmega, the 16-bit Texas Instruments MSP430, and the 32-bit ARM Cortex-M0+. We investigate their runtime, chip area, power, and energy characteristics regarding El...
متن کاملA new hope on ARM Cortex-M
Recently, Alkim, Ducas, Pöppelmann, and Schwabe proposed a Ring-LWE-based key exchange protocol called “NewHope” [2] and illustrated that this protocol is very efficient on large Intel processors. Their paper also claims that the parameter choice enables efficient implementation on small embedded processors. In this paper we show that these claims are actually correct and present NewHope softwa...
متن کاملFast Software Polynomial Multiplication on ARM Processors Using the NEON Engine
Efficient algorithms for binary field operations are required in several cryptographic operations such as digital signatures over binary elliptic curves and encryption. The main performance-critical operation in these fields is the multiplication, since most processors do not support instructions to carry out a polynomial multiplication. In this paper we describe a novel software multiplier for...
متن کامل